Generalized minimum spanning tree games

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Multi-criteria minimum cost spanning tree games

The minimum cost spanning tree game (mcst-game) is a well-known model within operations research games that has been widely studied in the literature. In this paper we introduce the multi-criteria version of the mcst-game as a setvalued TU-game. We prove that the extension of Bird s cost allocation rule provides dominance core elements in this game. We also give a family of core solutions that ...

متن کامل

Submodularity of minimum-cost spanning tree games

We give a necessary condition and a sufficient condition for a minimum-cost spanning tree game introduced by Bird to be submodular (or convex). When the cost is restricted to two values, we give a characterization of submodular minimum-cost spanning tree games. We also discuss algorithmic issues.

متن کامل

The Generalized Minimum Spanning Tree Problem

We consider the Generalized Minimum Spanning Tree Problem denoted by GMSTP. It is known that GMSTP is NP-hard and even finding a near optimal solution is NP-hard. We introduce a new mixed integer programming formulation of the problem which contains a polynomial number of constraints and a polynomial number of variables. Based on this formulation we give an heuristic solution, a lower bound pro...

متن کامل

Cost monotonicity, consistency and minimum cost spanning tree games

We propose a new cost allocation rule for minimum cost spanning tree games. The new rule is a core selection and also satis...es cost monotonicity. We also give characterization theorems for the new rule as well as the much-studied Bird allocation. We show that the principal di¤erence between these two rules is in terms of their consistency properties. JEL Classi...cation Numbers: D7

متن کامل

The Generalized Minimum Spanning Tree: Polyhedra and Branch-and-Cut

We analyze the facial structure of the polytope associated to the GMSTP with the aim of nding \good" inequalities to strengthen our previous linear formulations. Several families of inequalities which are facet-inducing for the polytope of the GMSTP are investigated. Our proofs of \facetness" for valid inequalities of the GMSTP polytope use tools developped in [3] and also classical results fro...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: EURO Journal on Computational Optimization

سال: 2015

ISSN: 2192-4406,2192-4414

DOI: 10.1007/s13675-015-0042-y